A simple image compression scheme is presented for various types of images, which include color/grayscale images, color-quantized images, and bilevel images such as document and digital halftone images. It is a bitplane coding composed of a new context modeling and adaptive binary arithmetic coding. A target bit to be encoded is conditioned by the estimates of the neighboring pixels including non-causal locations. Several functionalities are also integrated. They are arbitrary shaped ROI transmission, selective tile partitioning, accuracy scalability, and others. The proposed bitplane codec is competitive with JPEG-LS in lossless compression of 8-bit grayscale and 24-bit color images. The proposed codec is close to JBIG2 in bilevel image compression. It outperforms the existing standards in compression of 8-bit color-quantized images.

This paper presents a color demosaicing method applied to the Bayer pattern color filter array (CFA). Reliable estimation of an edge direction, edge-directed asymmetric interpolation, and the use of color samples at immediate neighbors are considered as the key guidelines for smooth and sharp image restoration. Also, special interest is directed to local areas that are rich in high spatial frequency variations. For suppression of false colors likely to occur in those areas, a hue vector representation is introduced so that the spatial correlation between different color components may be exploited in consistent with the local constant-hue principle. Smoothing is repeated in the hue vector field a few times. Experimental results have shown preferable performances in terms of PSNR, CIELAB color difference, hue angle difference, CIE chromaticity and visual appearance, in particular resulting in less false colors.

In this paper, a lifting implementation of variable-coefficient invertible deinterlacer with embedded motion detector is proposed. As previous works, the authors have developed invertible deinterlacing that suppresses comb-tooth artifacts caused by field interleaving for interlaced scanning video, which affect the quality of intraframe-based codec such as Motion-JPEG2000. To improve the local adaptability for given pictures, its variable-coefficient processing with motion detection has also been proposed so that filters can be changed according to local properties of motion pictures, while maintaining the invertibility. In this paper, it is shown that the variable-coefficient invertible deinterlacing can be realized by a lifting-based simple hardware architecture, and motion detector can also be embedded. Both of the motion detection and deinterlacing filters are shared by a special choice of their coefficients, and by adaptive selection of deinterlacing filters. The significance of our proposed architecture is verified by showing synthesis results from the VHDL models. The proposed implementation with embedded motion detector achieves about 28% reduction of the gate count compared with the corresponding separate implementation.

The demand for wireless mobile communications has grown at a very high rate, recently. In order to solve the non-uniform traffic rates, the use of cell splits is unavoidable for balancing the traffic rate and maximizing total system capacity. For cell planning, a DS-CDMA cellular system can be comprise of different cell sizes because of different demands and population density of the service area. In this paper, we develop a general model to study the forward link capacity and outage probability of a DS-CDMA cellular system with mixed cell sizes. The analysis of outage probability is carried out using the log-normal approximation. When a macrocell is split into the three microcells, as an example, we calculate the multi-cross interferences between macrocells and microcells, and the forward link capacities for the microcells and the neighboring macrocells. The maximum allowable capacity plane for macrocell and microcell is also investigated. The numerical results and discussions with previous published results of reverse link are summarized.

In this paper, the impact of timing jitter in direct sequence ultra wideband (DS-UWB) system is investigated over multipath fading channel. Also, a novel hybrid direct sequence multiband UWB (DS-MB-UWB) system is proposed to mitigate the impact of timing jitter. We analyze and compare the system performance for conventional DS-UWB and hybrid DS-MB-UWB with Rake receiver in the presence of timing jitter over additive white Gaussian noise (AWGN) and multipath channel. Theoretical framework is developed to calculate the amount of average energy captured in the multipath profiles and symbol error rate (SER) considering the presence of timing jitter. It is found that DS-MB-UWB system, which employs multiple sub-bands is more jitter-robust than conventional DS-UWB systems. Besides, timing jitter is found to have different impacts on DS-UWB and DS-MB-UWB systems corresponding to different parameters such as number of sub-bands employed, pulse shape, center frequency, bandwidth, number of combined paths in Rake receiver and channel power delay profile (PDP). These different impacts are analyzed and discussed in the paper.

In this paper, a design method of two-dimensional (2-D) orthogonal symmetric wavelets is proposed by using a lattice structure for multi-dimensional (M-D) linear-phase paraunitary filter banks (LPPUFB), which the authors have proposed as a previous work and then modified by Lu Gan et al. The derivation process for the constraints on the second-order vanishing moments is shown and some design examples obtained through optimization with the constraints are exemplified. In order to verify the significance of the constraints, some experimental results are shown for Lena and Barbara image.

In this paper, we propose the soft boundary concept achieved by dynamic tilted antenna to solve the issue of traffic congestion occurred in cellular wireless systems. The tilted antenna array can provide the merit of traffic balance and also achieve the optimization of the signal-to-interference ratio (SIR) at receivers by automatically tilting the antenna and implementing the soft boundary among cells, corresponding to the variation of traffic. According to our results, it is shown that power ratio control do not necessarily improved system performance when there is a large variation in traffic because it only control power levels. Also the properly chosen angle of tilt antenna can relieve the traffic congestion and perform the system performance optimization.

Multiple antenna systems are promising architectures for overcoming the effects of multi-path interference and increasing the spectrum efficiency. In order to be able to investigate these systems, in this article, we derive generalized spatial correlation equations of a circular antenna array for two typical angular energy distributions: a Gaussian angle distribution and uniform angular distribution. The generalized spatial correlation equations are investigated carefully by exact and approximate analyses.

In this paper, an online SNR estimator is proposed for parallel combinatorial SS (PC/SS) systems in Nakagami fading channels. The PC/SS systems are called as partial-code-parallel multicode DS/SS systems, which have the higher-speed data transmission capability comparing with conventional multicode DS/SS systems referred to as all-code-parallel systems. We propose an SNR estimator based on a statistical ratio of correlator outputs at the receiver. The SNR at the correlator output is estimated through a simple polynomial from the statistical ratio. We investigate the SNR estimation accuracy in Nakagami fading channels through computer simulations. In addition, we apply it to the convolutional coded PC/SS systems with iterative demodulation and decoding to evaluate the estimation performance from the viewpoint of error rate. Numerical results show that the PC/SS systems with the proposed SNR estimator have superior estimation performance to conventional DS/SS systems. It is also shown that the bit error rate performance using our SNR estimation method is close to the performance with perfect knowledge of channel state information in Nakagami fading channels and correlated Rayleigh fading channels.

This paper describes a design method of linear phase recursive FIR digital filters. The basic structure consists of a transversal part cascaded with a cyclotomic resonator, which is characterized by cycotomic polynomials and has no multipliers. The digital filters implemented by this method require the short wordlength both for multiplier coefficients and for signals in their transversal part. By introducing integer arithmetic, the filtering operation proceeds fast and exactly. As a bonus, it is possible to employ a multiplier-less implementation in most practical applications. While the stability of this type of structure requires an integer-valued impulse response, a satisfactory procedure assures the requirement. A parameter to control the approximation error is found somewhat predictively rather than tentatively.

In this paper, we derive spatial correlation functions of linear and circular antenna arrays for three types of angular energy distributions: a Gaussian angle distribution, the angular energy distribution arising from a Gaussian spatial distribution, and uniform angular distribution. The spatial correlation functions are investigated carefully. The spatial correlation is a function of antenna spacing, array geometry and the angular energy distribution. In order to emphasize the research and their applications in diversity reception, as an example, performance of the antenna arrays with MRC in correlated Nakagami fading channels is investigated, in which analytical formulas of average BER for the spatial correlation are obtained.

We propose a novel adaptive filtering scheme named metric-combining normalized least mean square (MC-NLMS). The proposed scheme is based on iterative metric projections with a metric designed by combining multiple metric-matrices convexly in an adaptive manner, thereby taking advantages of the metrics which rely on multiple pieces of information. We compare the improved PNLMS (IPNLMS) algorithm with the natural proportionate NLMS (NPNLMS) algorithm, which is a special case of MC-NLMS, and it is shown that the performance of NPNLMS is controllable with the combination coefficient as opposed to IPNLMS. We also present an application to an acoustic echo cancellation problem and show the efficacy of the proposed scheme.

We have developed a new computer-aided diagnostic system for differentiating oral borderline malignancies in hematoxylin-eosin stained microscopic images. Epithelial dysplasia and carcinoma in-situ (CIS) of oral mucosa are two different borderline grades similar to each other, and it is difficult to distinguish between them. A new image processing and analysis method has been applied to a variety of histopathological features and shows the possibility for differentiating the oral cancer borderline grades automatically. The method is based on comparing the drop-shape similarity level in a particular manually selected pair of neighboring rete ridges. It was found that the considered similarity level in dysplasia was higher than those in epithelial CIS, of which pathological diagnoses were conventionally made by pathologists. The developed image processing method showed a good promise for the computer-aided pathological assessment of oral borderline malignancy differentiation in clinical practice.

In this paper, ultra-wideband (UWB) multiple access systems are introduced by using direct-sequence (DS) and hybrid direct-sequence time-hopping (DS/TH) code division multiple access (CDMA) that use arbitrary chip-duty of the spreading sequences. The bit error probabilities are presented. First of all, the variances of the multiple access interference are developed by investigating the collision properties of the signals. Afterward, various approximations are applied. The standard Gaussian approximation (SGA) for the DS system is shown to become extremely optimistic as the chip-duty becomes low. Though the hybrid system performs better, the SGA still remains optimistic. To obtain accurate results, Holtzman's simplified improved Gaussian approximation (SIGA) and Morrow and Lehnert's improved Gaussian approximation (IGA) are used. A shortcoming of the SIGA is rediscovered that renders it unusable for low-duty DS systems, especially, at high signal-to-noise ratio. However, for the hybrid system, the SIGA works as an excellent tool. The IGA is used to get accurate results for the low-duty DS systems. It is shown that lowering of chip-duty by keeping chip rate and chip length unchanged improves performance for asynchronous DS and both asynchronous and synchronous hybrid systems. However, under the same processing gain, a high-duty system performs better than a low-duty system. Performance of synchronous DS system remains independent of chip-duty.

A unified polyphase representation of analysis and synthesis filter banks is introduced in this paper, and then the efficient implementation on digital signal processors (DSP) is investigated. Especially, the number of memory accesses, power consumption, processing accuracy and the required instruction cycles are discussed. Firstly, a unified representation is given, and then two types of procedures, SIMO system-based and MISO system-based procedures, are shown, where SIMO and MISO are abbreviations for single-input/multiple-output and multiple-input/single-output, respectively. These procedures are compared to each other. It is shown that the number of data load in SIMO system-based procedure is a half of that in MISO system-based procedure for two-channel filter banks. The implementation of M-channel filter banks is also discussed.

This paper proposes iterative demodulation/decoding for parallel combinatorial spread spectrum (PC/SS) systems. A PC/SS system conveys information data by a combination of pre-assigned orthogonal spreading sequences with polarity. In this paper, convolutional coding with a uniform random interleaver is implemented in channel coding, just like as a serial concatenated coding. A 'soft-in/soft-out' PC/SS demodulator based on a posteriori probability algorithm is proposed to perform the iterative demodulation and decoding. Simulation results demonstrate that the proposed iterative demodulation/decoding scheme bring significant improvement in bit error rate performance. This proposed decoding scheme achieves high-speed transmission by two approaches. One is a puncturing operation, and the other is to increase the number of transmitting sequences. In the latter approach, lower error rate performance is achieved comparing with that the punctured convolutional code is used to increase the information bit rate.

A direct procedure to realize pipelinable low-sensitivity digital filters is developed only in the z-domain. It is possible to realize arbitrary digital transfer functions using this procedure. The key concept for the low-sensitivity property lies both in the matching concept in doubly-terminated lossless networks and in the localization of transmission zeros. The synthesis procedure is based on successive extractions of transmission zeros by means of lossless but not always reciprocal transfer scattering matrices. Since a transfer scattering matrix involves the transmission zeros as its poles, such a matrix is suitable for their localization. Furthermore a universal first/second-degree section is derived explicitly.

Performance of Rake reception of Ultra Wideband (UWB) signals is evaluated from energy capture perspective. In addition to ordinary all Rake (ARake) and selective Rake (SRake) receivers which are considered in conventional spread spectrum communications, we introduce optimum ARake and SRake receivers which include the estimation of delay of the combining multipaths. Impact of pulse-width is discussed on their performances considering the relationship between pulse-width and fading. Time hopping M-ary pulse position modulation (TH-MPPM) and binary phase shift keying (TH-BPSK) are considered as modulation schemes. Extensive simulation results are presented showing the performances of the Rakes introduced using IEEE 802.15.3a UWB channel models (CM1 to CM3). Performance of MPPM is shown for various values of M and modulation parameters. The impact of pulse-width is illustrated mainly using BPSK. It is shown that the total energy capture (i.e. by ARake) strongly depends on the pulse-width, and the shorter the pulse-width the more is the amount. The energy capture also varies a lot for employing either optimum or ordinary Raking method. Energy capture by SRake additionally strongly depends on the number of combined paths until the number is 20 for optimum SRake and 10 for ordinary SRake; however, afterwards saturating effects are seen. Several aspects regarding the performance versus complexity issue of Rake receivers are also discussed.

Upper bounds on the bit error rate (BER) for maximum likelihood (ML) decoding are derived in convolutional coded parallel combinatorial spread spectrum (PC/SS) systems over additive white Gaussian noise (AWGN) channels. PC/SS systems can achieve higher data transmission than conventional multicode SS systems. To make the derivation tractable, we put a uniform interleaver between a convolutional encoder and a PC/SS transmitter. Since the PC/SS transmitter is employed as the "inner encoder," the bounds are obtained in a similar manner of the derivation in serially concatenated codes through a uniform interleaver. Two different error patterns in the PC/SS system are considered in the performance analysis. Numerical results show that the derived BER bounds are sufficiently accurate. It is found that the coded PC/SS systems outperform coded all-code-parallel DS/SS systems under the same data rate conditions if the number of pre-assigned PN codes increases.